<HTML><HEAD><TITLE>alldifferent_t(+Cs, +MC)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(tentative_constraints)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>alldifferent_t(+Cs, +MC)</H1>
Tentative value implementation of alldifferent constraint
<DL>
<DT><EM>Cs</EM></DT>
<DD>A list or array of variables/values
</DD>
<DT><EM>MC</EM></DT>
<DD>A monitored_constraint descriptor
</DD>
</DL>
<H2>Description</H2>

    	Tentative value implementation of alldifferent constraint.
	<P>
	The violatedness of the constraint is the number of identical
	value pairs among its arguments.
	<P>
	The following declaration is in effect, meaning that alldifferent_t/2
	is used whenever alldifferent/1 is added to a constraint set:
	<PRE>
	:- alldifferent_t/2 tent_implements alldiffernet/1.
	</PRE>
    
<H3>Modes and Determinism</H3><UL>
<LI>alldifferent_t(+, +) is det
</UL>
<H2>Examples</H2>
<PRE>
    ?- Xs = [A,B,C], Xs tent_set [1,2,3], CS :~ alldifferent(Xs).
    Xs = [A{1 -&gt; 0}, B{2 -&gt; 0}, C{3 -&gt; 0}]
    CS = constraint_set(TotalVio{0 -&gt; 0}, ...)
    There is 1 delayed goal.
    Yes (0.00s cpu)
    </PRE>
<H2>See Also</H2>
<A HREF="../../lib/tentative_constraints/alldifferent_t-3.html">alldifferent_t / 3</A>, <A HREF="../../lib/tentative_constraints/neq_t-3.html">neq_t / 3</A>, <A HREF="../../lib/tentative/tent_implements-2.html">tentative : tent_implements / 2</A>
</BODY></HTML>
